Grapheme Based Writer Verification
نویسنده
چکیده
In this communication we propose an approach for the writer verification task. The difficulty of this task lies first, in the decision making between the two assumptions which model the problem: "Do the two writings come from the same writer ?" or "Do the two writings come from different writers?" and second, in the evaluation of the error risk associated to this decision. We have called upon a mutual information based hypothesis test for the evaluation of these errors taking into account the distribution of the two assumptions (within-writer distribution and between-writer distribution) on a sample set of 88 writers. Features used for this writer verification problem are graphemes produced by a segmentation module. This verification process is intended to confirm or reject the writer candidates proposed by a writer identification system
منابع مشابه
Combining Multiple Features for Text-Independent Writer Identification and Verification
In recent years, we proposed a number of new and very effective features for automatic writer identification and verification. They are probability distribution functions (PDFs) extracted from the handwriting images and characterize writer individuality independently of the textual content of the written samples. In this paper, we perform an extensive analysis of feature combinations. In our fu...
متن کاملImproving Grapheme Codebook Selection for Scribe Identification
In this paper we test several approaches to analysing grapheme codebook features for offline writer identification in medieval English scribal manuscripts. Current methods for selecting a codebook typically produce codebooks that perform no better than random grapheme selection, so our aim in this analysis is to identify potential methods of improving codebook selection. Three feature extractio...
متن کاملVerification of Graphemes Using Neural Networks in an Hmm-based On-line Korean Handwriting Recognition System
This paper presents a neural network based verification method in an HMM-based on-line Korean handwriting recognition system. It penalizes unreasonable grapheme hypotheses and complements global and structural information to the HMM-based recognition system, which is intrinsically based on local information. In the proposed system, each grapheme has one neural network verifier as well as one HM...
متن کاملG Verification of Graphemes Using Neural Networks in an Hmm-based On-line Korean Handwriting Recognition System
This paper presents a neural network based verification method in an HMM-based on-line Korean handwriting recognition system. It penalizes unreasonable grapheme hypotheses and complements global and structural information to the HMM-based recognition system, which is intrinsically based on local information. In the proposed system, each grapheme has one neural network verifier as well as one HM...
متن کاملAutomatic Writer Identification in Medieval Papal Charters
Automatic writer identification and writer verification has recently received significant attention in the field of historical analysis. In this work a short overview of current approaches for writer identification is given. Current state-of-the-art results on contemporary data are related to different approaches for writer verification on a small dataset of datum lines extracted from papal cha...
متن کامل